منابع مشابه
Collisions for Round-Reduced LAKE
LAKE is a family of cryptographic hash functions presented at FSE 2008. It is an iterated hash function and defines two main instances with a 256 bit and 512 bit hash value. In this paper, we present the first security analysis of LAKE. We show how collision attacks, exploiting the non-bijectiveness of the internal compression function of LAKE, can be mounted on reduced variants of LAKE. We sho...
متن کاملOn the facility location problem: One-round weighted Voronoi game
Voronoi game presents a simple geometric model for Competitive facility location problems with two players. Voronoi game is played by two players known as White and Black, they play in a continuous arena. In the one-round game, White starts game and places all his points in the arena then Black places her points. Then the arena is divided by distance between two players and the player with the ...
متن کامل“What goes round comes round”
Soon after the discovery of x-rays by Roentgen, radioactivity by Becquerel, and radium by the Curies, it was concluded that x-rays could not only be used for diagnostic purposes but also for therapy [1,2]. In the early years of radiation therapy, physicians had little understanding or knowledge of the physical nature and biological effects of radiation, the delivered doses were not certain, the...
متن کاملSchool in the Round
become 'an integral part of the school curriculum'. So far four titles have appeared (Mental Health, Physical Handicap, Strangers and New Britons and Constructional Projects) and four more are beifl' prepared. The writers are Mora and Alec Dickso^ already well-known as founders of VSO and Co& munity Service Volunteers. Each of the four 'kits' so far produced consist of an illustrated folder, wh...
متن کاملImproving the Round Complexity of ‘Round-Optimal’ VSS∗
We revisit the following question: what is the optimal round complexity of verifiable secret sharing (VSS)? We focus here on the case of perfectly-secure VSS where the number of corrupted parties t satisfies t < n/3, with n being the total number of parties. Work of Gennaro et al. (STOC 2001) and Fitzi et al. (TCC 2006) shows that, assuming a broadcast channel, 3 rounds are necessary and suffic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Atmosphere
سال: 1976
ISSN: 0004-6973
DOI: 10.1080/00046973.1976.9648402